翻訳と辞書
Words near each other
・ Immaculate Machine
・ Immaculate Machine's Fables
・ Immaculate Mary
・ Immaculate Misconception
・ Immaculate perception
・ Immaculate Reception
・ Immaculée Ilibagiza
・ Immaculée Nahayo
・ Immad Akhund
・ Immadi Pulikeshi (film)
・ Immadihalli
・ Immagine
・ Immagine in Cornice
・ Immalanjärvi
・ Imman Annachi
Immanant of a matrix
・ Immanence
・ Immaneni Sathyamurthy
・ Immanent critique
・ Immanent evaluation
・ Immanent Grove
・ Immanentize the eschaton
・ Immanu El
・ Immanuel
・ Immanuel (film)
・ Immanuel (town)
・ Immanuel Aboab
・ Immanuel Alm
・ Immanuel Armenian Congregational Church
・ Immanuel Baptist Church


Dictionary Lists
翻訳と辞書 辞書検索 [ 開発暫定版 ]
スポンサード リンク

Immanant of a matrix : ウィキペディア英語版
:''Immanant redirects here; it should not be confused with the philosophical immanent.''In mathematics, the immanant of a matrix was defined by Dudley E. Littlewood and Archibald Read Richardson as a generalisation of the concepts of determinant and permanent.Let \lambda=(\lambda_1,\lambda_2,\ldots) be a partition of n and let \chi_\lambda be the corresponding irreducible representation-theoretic character of the symmetric group S_n. The ''immanant'' of an n\times n matrix A=(a_) associated with the character \chi_\lambda is defined as the expression:_\lambda(A)=\sum_\chi_\lambda(\sigma)a_a_\cdots a_.The determinant is a special case of the immanant, where \chi_\lambda is the alternating character \sgn, of ''S'n'', defined by the parity of a permutation.The permanent is the case where \chi_\lambda is the trivial character, which is identically equal to 1.For example, for 3 \times 3 matrices, there are three irreducible representations of S_3, as shown in the character table:As stated above, \chi_1 produces the permanent and \chi_2 produces the determinant, but \chi_3 produces the operation that maps as follows::\begin a_ & a_ & a_ \\ a_ & a_ & a_ \\ a_ & a_ & a_ \end \rightsquigarrow 2 a_ a_ a_ - a_ a_ a_ - a_ a_ a_Littlewood and Richardson also studied its relation to Schur functions in the representation theory of the symmetric group.==References==* *
:''Immanant redirects here; it should not be confused with the philosophical immanent.''
In mathematics, the immanant of a matrix was defined by Dudley E. Littlewood and Archibald Read Richardson as a generalisation of the concepts of determinant and permanent.
Let \lambda=(\lambda_1,\lambda_2,\ldots) be a partition of n and let \chi_\lambda be the corresponding irreducible representation-theoretic character of the symmetric group S_n. The ''immanant'' of an n\times n matrix A=(a_) associated with the character \chi_\lambda is defined as the expression
:_\lambda(A)=\sum_\chi_\lambda(\sigma)a_a_\cdots a_.
The determinant is a special case of the immanant, where \chi_\lambda is the alternating character \sgn, of ''S''''n'', defined by the parity of a permutation.
The permanent is the case where \chi_\lambda is the trivial character, which is identically equal to 1.
For example, for 3 \times 3 matrices, there are three irreducible representations of S_3, as shown in the character table:
As stated above, \chi_1 produces the permanent and \chi_2 produces the determinant, but \chi_3 produces the operation that maps as follows:
:\begin a_ & a_ & a_ \\ a_ & a_ & a_ \\ a_ & a_ & a_ \end \rightsquigarrow 2 a_ a_ a_ - a_ a_ a_ - a_ a_ a_
Littlewood and Richardson also studied its relation to Schur functions in the representation theory of the symmetric group.
==References==

*
*

抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)
ウィキペディアで「:''Immanant redirects here; it should not be confused with the philosophical immanent.''In mathematics, the '''immanant of a matrix''' was defined by Dudley E. Littlewood and Archibald Read Richardson as a generalisation of the concepts of determinant and permanent.Let \lambda=(\lambda_1,\lambda_2,\ldots) be a partition of n and let \chi_\lambda be the corresponding irreducible representation-theoretic character of the symmetric group S_n. The ''immanant'' of an n\times n matrix A=(a_) associated with the character \chi_\lambda is defined as the expression:_\lambda(A)=\sum_\chi_\lambda(\sigma)a_a_\cdots a_.The determinant is a special case of the immanant, where \chi_\lambda is the alternating character \sgn, of ''S''''n'', defined by the parity of a permutation.The permanent is the case where \chi_\lambda is the trivial character, which is identically equal to 1.For example, for 3 \times 3 matrices, there are three irreducible representations of S_3, as shown in the character table:As stated above, \chi_1 produces the permanent and \chi_2 produces the determinant, but \chi_3 produces the operation that maps as follows::\begin a_ & a_ & a_ \\ a_ & a_ & a_ \\ a_ & a_ & a_ \end \rightsquigarrow 2 a_ a_ a_ - a_ a_ a_ - a_ a_ a_Littlewood and Richardson also studied its relation to Schur functions in the representation theory of the symmetric group.==References==* * 」の詳細全文を読む
n'', defined by the parity of a permutation.The permanent is the case where \chi_\lambda is the trivial character, which is identically equal to 1.For example, for 3 \times 3 matrices, there are three irreducible representations of S_3, as shown in the character table:As stated above, \chi_1 produces the permanent and \chi_2 produces the determinant, but \chi_3 produces the operation that maps as follows::\begin a_ & a_ & a_ \\ a_ & a_ & a_ \\ a_ & a_ & a_ \end \rightsquigarrow 2 a_ a_ a_ - a_ a_ a_ - a_ a_ a_Littlewood and Richardson also studied its relation to Schur functions in the representation theory of the symmetric group.==References==* *

:''Immanant redirects here; it should not be confused with the philosophical immanent.''
In mathematics, the immanant of a matrix was defined by Dudley E. Littlewood and Archibald Read Richardson as a generalisation of the concepts of determinant and permanent.
Let \lambda=(\lambda_1,\lambda_2,\ldots) be a partition of n and let \chi_\lambda be the corresponding irreducible representation-theoretic character of the symmetric group S_n. The ''immanant'' of an n\times n matrix A=(a_) associated with the character \chi_\lambda is defined as the expression
:_\lambda(A)=\sum_\chi_\lambda(\sigma)a_a_\cdots a_.
The determinant is a special case of the immanant, where \chi_\lambda is the alternating character \sgn, of ''S''''n'', defined by the parity of a permutation.
The permanent is the case where \chi_\lambda is the trivial character, which is identically equal to 1.
For example, for 3 \times 3 matrices, there are three irreducible representations of S_3, as shown in the character table:
As stated above, \chi_1 produces the permanent and \chi_2 produces the determinant, but \chi_3 produces the operation that maps as follows:
:\begin a_ & a_ & a_ \\ a_ & a_ & a_ \\ a_ & a_ & a_ \end \rightsquigarrow 2 a_ a_ a_ - a_ a_ a_ - a_ a_ a_
Littlewood and Richardson also studied its relation to Schur functions in the representation theory of the symmetric group.
==References==

*
*

抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)
ウィキペディアで「:''Immanant redirects here; it should not be confused with the philosophical immanent.''In mathematics, the '''immanant of a matrix''' was defined by Dudley E. Littlewood and Archibald Read Richardson as a generalisation of the concepts of determinant and permanent.Let \lambda=(\lambda_1,\lambda_2,\ldots) be a partition of n and let \chi_\lambda be the corresponding irreducible representation-theoretic character of the symmetric group S_n. The ''immanant'' of an n\times n matrix A=(a_) associated with the character \chi_\lambda is defined as the expression:_\lambda(A)=\sum_\chi_\lambda(\sigma)a_a_\cdots a_.The determinant is a special case of the immanant, where \chi_\lambda is the alternating character \sgn, of ''S''''n'', defined by the parity of a permutation.The permanent is the case where \chi_\lambda is the trivial character, which is identically equal to 1.For example, for 3 \times 3 matrices, there are three irreducible representations of S_3, as shown in the character table:As stated above, \chi_1 produces the permanent and \chi_2 produces the determinant, but \chi_3 produces the operation that maps as follows::\begin a_ & a_ & a_ \\ a_ & a_ & a_ \\ a_ & a_ & a_ \end \rightsquigarrow 2 a_ a_ a_ - a_ a_ a_ - a_ a_ a_Littlewood and Richardson also studied its relation to Schur functions in the representation theory of the symmetric group.==References==* * 」の詳細全文を読む
n'', defined by the parity of a permutation.The permanent is the case where \chi_\lambda is the trivial character, which is identically equal to 1.For example, for 3 \times 3 matrices, there are three irreducible representations of S_3, as shown in the character table:As stated above, \chi_1 produces the permanent and \chi_2 produces the determinant, but \chi_3 produces the operation that maps as follows::\begin a_ & a_ & a_ \\ a_ & a_ & a_ \\ a_ & a_ & a_ \end \rightsquigarrow 2 a_ a_ a_ - a_ a_ a_ - a_ a_ a_Littlewood and Richardson also studied its relation to Schur functions in the representation theory of the symmetric group.==References==* * ">ウィキペディア(Wikipedia)』
ウィキペディアで「:''Immanant redirects here; it should not be confused with the philosophical immanent.''In mathematics, the '''immanant of a matrix''' was defined by Dudley E. Littlewood and Archibald Read Richardson as a generalisation of the concepts of determinant and permanent.Let \lambda=(\lambda_1,\lambda_2,\ldots) be a partition of n and let \chi_\lambda be the corresponding irreducible representation-theoretic character of the symmetric group S_n. The ''immanant'' of an n\times n matrix A=(a_) associated with the character \chi_\lambda is defined as the expression:_\lambda(A)=\sum_\chi_\lambda(\sigma)a_a_\cdots a_.The determinant is a special case of the immanant, where \chi_\lambda is the alternating character \sgn, of ''S''''n'', defined by the parity of a permutation.The permanent is the case where \chi_\lambda is the trivial character, which is identically equal to 1.For example, for 3 \times 3 matrices, there are three irreducible representations of S_3, as shown in the character table:As stated above, \chi_1 produces the permanent and \chi_2 produces the determinant, but \chi_3 produces the operation that maps as follows::\begin a_ & a_ & a_ \\ a_ & a_ & a_ \\ a_ & a_ & a_ \end \rightsquigarrow 2 a_ a_ a_ - a_ a_ a_ - a_ a_ a_Littlewood and Richardson also studied its relation to Schur functions in the representation theory of the symmetric group.==References==* * 」の詳細全文を読む
n'', defined by the parity of a permutation.The permanent is the case where \chi_\lambda is the trivial character, which is identically equal to 1.For example, for 3 \times 3 matrices, there are three irreducible representations of S_3, as shown in the character table:As stated above, \chi_1 produces the permanent and \chi_2 produces the determinant, but \chi_3 produces the operation that maps as follows::\begin a_ & a_ & a_ \\ a_ & a_ & a_ \\ a_ & a_ & a_ \end \rightsquigarrow 2 a_ a_ a_ - a_ a_ a_ - a_ a_ a_Littlewood and Richardson also studied its relation to Schur functions in the representation theory of the symmetric group.==References==* * ">ウィキペディアで「:''Immanant redirects here; it should not be confused with the philosophical immanent.''In mathematics, the immanant of a matrix was defined by Dudley E. Littlewood and Archibald Read Richardson as a generalisation of the concepts of determinant and permanent.Let \lambda=(\lambda_1,\lambda_2,\ldots) be a partition of n and let \chi_\lambda be the corresponding irreducible representation-theoretic character of the symmetric group S_n. The ''immanant'' of an n\times n matrix A=(a_) associated with the character \chi_\lambda is defined as the expression:_\lambda(A)=\sum_\chi_\lambda(\sigma)a_a_\cdots a_.The determinant is a special case of the immanant, where \chi_\lambda is the alternating character \sgn, of ''S'n'', defined by the parity of a permutation.The permanent is the case where \chi_\lambda is the trivial character, which is identically equal to 1.For example, for 3 \times 3 matrices, there are three irreducible representations of S_3, as shown in the character table:As stated above, \chi_1 produces the permanent and \chi_2 produces the determinant, but \chi_3 produces the operation that maps as follows::\begin a_ & a_ & a_ \\ a_ & a_ & a_ \\ a_ & a_ & a_ \end \rightsquigarrow 2 a_ a_ a_ - a_ a_ a_ - a_ a_ a_Littlewood and Richardson also studied its relation to Schur functions in the representation theory of the symmetric group.==References==* * 」の詳細全文を読む
n'', defined by the parity of a permutation.The permanent is the case where \chi_\lambda is the trivial character, which is identically equal to 1.For example, for 3 \times 3 matrices, there are three irreducible representations of S_3, as shown in the character table:As stated above, \chi_1 produces the permanent and \chi_2 produces the determinant, but \chi_3 produces the operation that maps as follows::\begin a_ & a_ & a_ \\ a_ & a_ & a_ \\ a_ & a_ & a_ \end \rightsquigarrow 2 a_ a_ a_ - a_ a_ a_ - a_ a_ a_Littlewood and Richardson also studied its relation to Schur functions in the representation theory of the symmetric group.==References==* * 」
の詳細全文を読む



スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース

Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.